Streaming Algorithm for Euler Characteristic Curves of Multidimensional Images
نویسندگان
چکیده
We present an efficient algorithm to compute Euler characteristic curves of gray scale images of arbitrary dimension. In various applications the Euler characteristic curve is used as a descriptor of an image. Our algorithm is the first streaming algorithm for Euler characteristic curves. The usage of streaming removes the necessity to store the entire image in RAM. Experiments show that our implementation handles terabyte scale images on commodity hardware. Due to lock-free parallelism, it scales well with the number of processor cores. Additionally, we put the concept of the Euler characteristic curve in the wider context of computational topology. In particular, we explain the connection with persistence diagrams.
منابع مشابه
The Geometry of the Critically Periodic Curves in the Space of Cubic Polynomials
We provide an algorithm for computing the Euler characteristic of the curves Sp in P 3 ' C, consisting of all polynomials with a periodic critical point of period p in the space of critically-marked, complex, cubic polynomials. The curves were introduced in [Mi, BKM], and the algorithm applies the main results of [DP]. The output is shown for periods p ≤ 26.
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملThe Euler Characteristic of Local Systems on the Moduli of Genus 3 Hyperelliptic Curves
For a partition λ = {λ1 ≥ λ2 ≥ λ3 ≥ 0} of non-negative integers, we calculate the Euler characteristic of the local system Vλ on the moduli space of genus 3 hyperelliptic curves using a suitable stratification. For some λ of low degree, we make a guess for the motivic Euler characteristic of Vλ using counting curves over finite fields.
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کامل